Generalized pigeon-inspired optimization algorithms
نویسندگان
چکیده
منابع مشابه
Nature-Inspired Optimization Algorithms
The performance of any algorithm will largely depend on the setting of its algorithmdependent parameters. The optimal setting should allow the algorithm to achieve the best performance for solving a range of optimization problems. However, such parameter tuning is itself a tough optimization problem. In this chapter, we present a framework for self-tuning algorithms so that an algorithm to be t...
متن کاملMetaheuristic Optimization: Nature-Inspired Algorithms and Applications
Turing’s pioneer work in heuristic search has inspired many generations of research in heuristic algorithms. In the last two decades, metaheuristic algorithms have attracted strong attention in scientific communities with significant developments, especially in areas concerning swarm intelligence based algorithms. In this work, we will briefly review some of the important achievements in metahe...
متن کاملBio-inspired Optimization Algorithms for Clustering
One of the ways to improve the efficiency of Information Retrieval (IR) systems is through document clustering. The search result of an IR system can be grouped or clustered so that the retrieval is made faster. Efficiency of IR systems has to be improved without compromising the quality of clusters. This paper presents a comparative study of the quality of cluster results by solving the proble...
متن کاملPhysics-Inspired Optimization Algorithms: A Survey
Natural phenomenon can be used to solve complex optimization problems with its excellent facts, functions, and phenomenon. In this paper, a survey on physics-based algorithm is done to show how these inspirations led to the solution of well-known optimization problem. The survey is focused on inspirations that are originated from physics, their formulation into solutions, and their evolution wi...
متن کاملBio-inspired Algorithms for TSP and Generalized TSP
The Traveling Salesman Problem (TSP) is to find a Hamiltonian tour of minimal length on a fully connected graph. The TSP is a NP-Complete, and there is no polynomial algorithm to find the optimal result. Many bio-inspired algorithms has been proposed to address this problem. Generally, generic algorithm (GA), ant colony optimization (ACO) and particle swarm optimization (PSO) are three typical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2019
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-018-9727-y